Neighbourhood-width of trees
نویسندگان
چکیده
منابع مشابه
Linear Rank-Width and Linear Clique-Width of Trees
We show that for every forest T the linear rank-width of T is equal to the path-width of T , and the linear clique-width of T equals the path-width of T plus two, provided that T contains a path of length three. It follows that both linear rank-width and linear clique-width of forests can be computed in linear time. Using our characterization of linear rank-width of forests, we determine the se...
متن کاملNatural Trees - Neighbourhood-Location in a Nutshell
15 7. Summary We have introduced natural trees as hierarchical data access structures that allow eecient access to neighbourhoods in a spatial database by exploiting both the signiicant branch design of conventional trees and the ad-jacency information available from natural neighbour order. Natural trees are built with a natural neighbour sorting process and amended by such sorting on an immed...
متن کاملThe Width of Galton-watson Trees
It is proved that the moments of the width of Galton-Watson trees with oospring variance are asymptotically given by (p n) p mp where mp are the moments of the maximum of the local time of a standard scaled Brownian excursion. This is done by combining a weak limit theorem and a tightness estimate. The method is quite general and we state some further applications.
متن کاملBranch-and-Prune trees with bounded width
The Molecular Distance Geometry Problem, which asks to find the embedding in R of a given weighted undirected graph, is a good model for determining the structure of proteins given a set of inter-atomic distances [6,4]. Its generalization to R is called Distance Geometry Problem (DGP), which has applications in wireless sensor networks [2] and graph drawing. In general, the MDGP and DGP implici...
متن کاملProfiles of Random Trees: Correlation and Width of Ran- Dom Recursive Trees and Binary Search Trees
The levels of trees are nodes with the same distance to the root. We derive asymptotic approximations to the correlation coefficients of two level sizes in random recursive trees and binary search trees, which undergo sharp sign-changes when one level is fixed and the other one is varying. We also propose a new means for deriving an asymptotic estimate for the expected width, which is the numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2016
ISSN: 0012-365X
DOI: 10.1016/j.disc.2015.08.015